The Convex Hull of Rational Plane Curves
نویسندگان
چکیده
We present an algorithm that computes the convex hull of multiple rational curves in the plane. The problem is reformulated as one of nding the zero-sets of polynomial equations in one or two variables; using these zero-sets we characterize curve segments that belong to the boundary of the convex hull. We also present a preprocessing step that can eliminate many redundant curve segments.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملMinimum area enclosure and alpha hull of a set of freeform planar closed curves
Of late, researchers appear to be intrigued with the question; Given a set of points, what is the region occupied by them? The answer appears to be neither straight forward nor unique. Convex hull, which gives a convex enclosure of the given set, concave hull, which generates nonconvex polygons and other variants such as α-hull, poly hull, r-shape and s-shape etc. have been proposed. In this pa...
متن کاملRelative Convex Hull Determination from Convex Hulls in the Plane
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem of its determination in the plane is equivalent to find the shortest curve among all Jordan curves lying in the difference set of B and A and en...
متن کاملOn the Convex Hulls of Parametric Plane Curves
Linear-time convex hull algorithms are known to exist for polygons and planar objects bounded by piecewise algebraic curves. Most of the existing algorithms laboriously trace out the so-called “pockets” formed by the concave portions of an object’s boundary. Objects bounded by general parametric curves have been excluded from the previous study partly because the nature of computation is seemin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphical Models
دوره 63 شماره
صفحات -
تاریخ انتشار 2001